package com.clps.algorithm.chapter14.路径的数目;

import java.util.Arrays;

/**
 *
 */
public class demo02 {
    public static void main(String[] args) {

    }

    public int uniquePaths(int m,int n){
        int[][] dp = new int[m][n];
        Arrays.fill(dp[0],1);
        for (int i = 0; i <m; i++) {
           dp[i][0] = 1;
        }


        for (int i = 0; i <m ; i++) {
            for (int j = 0; j <n ; j++) {
                dp[i][j] = dp[i][j-1]+dp[i-1][j];
            }
        }
        return  dp[m-1][n-1];
    }
}
